Fast Polynomials Multiplication Using FFT
نویسندگان
چکیده
منابع مشابه
When is FFT multiplication of arbitrary-precision polynomials practical?
It is well recognized in the computer algebra theory and systems communities that the Fast Fourier Transform (FFT) can be used for multiplying polynomials. Theory predicts that it is fast for “large enough” polynomials. Even so, it appears that no major general-purpose computer algebra system uses the FFT as a general default technique for this purpose. Some provide (optional) access to FFT tec...
متن کاملFaster Multiplication for Long Binary Polynomials
We set new speed records for multiplying long polynomials over finite fields of characteristic two. Our multiplication algorithm is based on an additive FFT (Fast Fourier Transform) by Lin, Chung, and Huang in 2014 comparing to previously best results based on multiplicative FFTs. Both methods have similar complexity for arithmetic operations on underlying finite field; however, our implementat...
متن کاملMultiplying boolean Polynomials with Frobenius Partitions in Additive Fast Fourier Transform
We show a new algorithm and its implementation for multiplying bitpolynomials of large degrees. The algorithm is based on evaluating polynomials at a specific set comprising a natural set for evaluation with additive FFT and a high order element under Frobenius map of F2. With the high order element, we can derive more values of the polynomials under Frobenius map. Besides, we also adapt the ad...
متن کاملACTA UNIVERSITATIS APULENSIS Special Issue KARATSUBA AND TOOM-COOK METHODS FOR MULTIVARIATE POLYNOMIALS
Karatsuba and Toom-Cook are well-known methods used to efficiently multiply univariate polynomials and long integers. For multivariate polynomials, asymptotically good approaches like Kronecker’s trick combined with FFT become truly effective only when the degree is above some threshold. In this paper we analyze Karatsuba and some of Toom-Cook methods for multivariate polynomials, considering d...
متن کاملA Fast and Efficient On-Line Harmonics Elimination Pulse Width Modulation for Voltage Source Inverter Using Polynomials Curve Fittings
The paper proposes an algorithm to calculate the switching angles using harmonic elimination PWM (HEPWM) scheme for voltage source inverter. The algorithm is based on curve fittings of a certain polynomials functions. The resulting equations require only the addition and multiplication processes; therefore, it can be implemented efficiently on a microprocessor. An extensive angle error analysis...
متن کامل